| 1. | The parse tree for this might look something like this 与此对应的解析树如下所示: |
| 2. | A special node to mark the end of the parse tree 标志解析树结束的特殊节点 |
| 3. | As data and not as a part of your parse tree 作为数据,而不是用它作为解析树的一部分。 |
| 4. | The module of parsing tree is credible 其解析树的生成模块具有较高的可靠性和容错能力。 |
| 5. | Given the parse tree , you apply the algorithm in 给定解析树,可以应用 |
| 6. | Later on we will combine token sequences into parse trees 稍后我们会将记号序列组合成解析树。 |
| 7. | Your application could do more interesting things with the parse tree 您的应用程序可以用解析树做更多有趣的事情。 |
| 8. | The provider will reparse the codedom tree and pass the resulting parse tree to the 该提供程序将重新分析codedom树,并将生成的分析树传递到 |
| 9. | In fact , the example parse tree you looked at previously is almost a valid scheme program 实际上,前面所研究的解析树示例几乎就是一个合法的scheme程序。 |
| 10. | It would be really interesting though , if there were a language that operated directly on parse trees 不过,真正值得关注的是,是否有直接操作解析树的语言。 |